Affine factor complexity of infinite words associated with simple Parry numbers
نویسندگان
چکیده
In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a β-numeration system. We provide a necessary and sufficient condition on the Rényi expansion of 1 for having an affine factor complexity map C(n), that is, such that C(n) = an+ b for any n ∈ N.
منابع مشابه
Factor complexity of infinite words associated with non-simple Parry numbers
The factor complexity of the infinite word uβ canonically associated to a non-simple Parry number β is studied. Our approach is based on the notion of special factors introduced by Berstel and Cassaigne. At first, we give a handy method for determining infinite left special branches; this method is applicable to a broad class of infinite words which are fixed points of a primitive substitution....
متن کاملPalindromic complexity of infinite words associated with non-simple Parry numbers
We study the palindromic complexity of infinite words uβ , the fixed points of the substitution over a binary alphabet, φ(0) = 01, φ(1) = 01, with a − 1 ≥ b ≥ 1, which are canonically associated with quadratic non-simple Parry numbers β. 1991 Mathematics Subject Classification. 68R15, 11A63 .
متن کاملAbelian complexity of infinite words associated with quadratic Parry numbers
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers. © 2011 Elsevier B.V. All rights reserved.
متن کامل2 00 7 Return Words in Fixed Points of Substitutions
We present three simple ideas which enable to determine easily the number of return words in some infinite words. Using these ideas, we give a new and very short proof of the fact that each factor of an Arnoux-Rauzy word of order m has exactly m return words. We describe the structure of return words for the Thue-Morse sequence and focus on infinite words which are associated to simple Parry nu...
متن کاملReturn Words in the Thue-morse and Other Sequences
We present three simple ideas which enable to determine easily the number of return words in some infinite words. Using these ideas, we give a new and very short proof of the fact that each factor of an Arnoux-Rauzy word of order m has exactly m return words. We describe the structure of return words for the Thue-Morse sequence and focus on infinite words which are associated to simple Parry nu...
متن کامل